Optimal Adjustment Algorithm for p Coordinates and the Starting Point in Interior Point Methods
نویسندگان
چکیده
Carla T. L. S. Ghidini, Aurelio R. L. Oliveira, Jair Silva Institute of Mathematics, Statistics and Scientific of Computation (IMECC), State University of Campinas (UNICAMP), São Paulo, Brazil Federal University of Mato Grosso do Sul (UFMS), Mato Grosso do Sul, Brazil E-mail: {carla, aurelio}@ime.unicamp.br, [email protected] Received September 15, 2011; revised October 16, 2011; accepted October 30, 2011
منابع مشابه
A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
A full Nesterov-Todd (NT) step infeasible interior-point algorithm is proposed for solving monotone linear complementarity problems over symmetric cones by using Euclidean Jordan algebra. Two types of full NT-steps are used, feasibility steps and centering steps. The algorithm starts from strictly feasible iterates of a perturbed problem, and, using the central path and feasi...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملModeling of Optimal Distances of Surveying Stations for Monitoring Astable Engineering Structures Using Geodetic Methods
Large and astable engineering structures are the great importance and the behavior of such structures is usually made in Geotechnical and Geodetic methods (engineering geodesy). In the geodetic methods, the selection of appropriate surveying stations, in terms of distribution, locations, and distant of the target points to stations the control network, have a significant role in determining th...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کاملAn infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012